on edge detour index polynomials
نویسندگان
چکیده
the edge detour index polynomials were recently introduced for computing theedge detour indices. in this paper we nd relations among edge detour polynomials for the2-dimensional graph of tuc4c8(s) in a euclidean plane and tuc4c8(s) nanotorus.
منابع مشابه
On edge detour index polynomials
The edge detour index polynomials were recently introduced for computing the edge detour indices. In this paper we find relations among edge detour polynomials for the 2-dimensional graph of $TUC_4C_8(S)$ in a Euclidean plane and $TUC4C8(S)$ nanotorus.
متن کاملThe explicit relation among the edge versions of detour index
The vertex version of detour index was defined during the works on connected graph in chemistry. The edge versions of detour index have been introduced ecently. In this paper, the explicit relations among edge versions of detour index have been declared and due to these relations, we compute the edge detour indices for some well-known graphs.
متن کاملOn edge detour graphs
For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u–v path in G. A u–v path of length D(u, v) is called a u–v detour. A set S ⊆ V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn1(G) of G is the minimum order of its edge detour sets and any edge detour set of order dn1...
متن کاملOn Detour Index
The detour index of a connected graph is defined as the sum of the detour distances (lengths of longest paths) between unordered pairs of vertices of the graph. We give bounds for the detour index, determine the graphs with minimum and maximum detour indices respectively in the class of n-vertex unicyclic graphs with cycle length r, where 3 ≤ r ≤ n−2, and the graphs with the first, the second a...
متن کاملThe Forcing Edge-to-vertex Detour Number of a Graph
For two vertices u and v in a graph G = (V, E), the detour distance D (u, v) is the length of a longest u – v path in G. A u – v path of length D (u, v) is called a u – v detour. For subsets A and B of V, the detour distance D (A, B) is defined as D (A, B) = min {D (x, y) : x ∈ A, y ∈ B}. A u – v path of length D (A, B) is called an A – B detour joining the sets A, B V where u ∈ A and v ∈ B. A...
متن کاملUpper Edge Detour Monophonic Number of a Graph
For a connected graph G of order at least two, a path P is called a monophonic path if it is a chordless path. A longest x−y monophonic path is called an x − y detour monophonic path. A set S of vertices of G is an edge detour monophonic set of G if every edge of G lies on a detour monophonic path joining some pair of vertices in S. The edge detour monophonic number of G is the minimum cardinal...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of linear and topological algebra (jlta)جلد ۲، شماره ۰۲، صفحات ۸۳-۸۹
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023